Learning Fast Adaptation With Meta Strategy Optimization
نویسندگان
چکیده
منابع مشابه
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
For N-way, K-shot classification, each gradient is computed using a batch size of NK examples. For Omniglot, the 5-way convolutional and non-convolutional MAML models were each trained with 1 gradient step with step size α = 0.4 and a meta batch-size of 32 tasks. The network was evaluated using 3 gradient steps with the same step size α = 0.4. The 20-way convolutional MAML model was trained and...
متن کاملModel-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
We propose an algorithm for meta-learning that is model-agnostic, in the sense that it is compatible with any model trained with gradient descent and applicable to a variety of different learning problems, including classification, regression, and reinforcement learning. The goal of meta-learning is to train a model on a variety of learning tasks, such that it can solve new learning tasks using...
متن کاملWell Placement Optimization with the Covariance Matrix Adaptation Evolution Strategy and Meta-Models
The amount of hydrocarbon recovered can be considerably increased by finding optimal placement of non-conventional wells. For that purpose, the use of optimization algorithms, where the objective function is evaluated using a reservoir simulator, is needed. Furthermore, for complex reservoir geologies with high heterogeneities, the optimization problem requires algorithms able to cope with the ...
متن کاملMeta-learning and meta-optimization
Meta-learning is a method of improving results of algorithm by learning from metafeatures which describe problem instances and from results produced by various algorithms on these instances. In this project we tried to apply this idea, which was already proved to be useful in machine learning, to combinatorial optimization. We have developed a general software tool called SEAGE to extract meta-...
متن کاملMatroid Bandits: Fast Combinatorial Optimization with Learning
A matroid is a notion of independence in combinatorial optimization which is closely related to computational efficiency. In particular, it is well known that the maximum of a constrained modular function can be found greedily if and only if the constraints are associated with a matroid. In this paper, we bring together the ideas of bandits and matroids, and propose a new class of combinatorial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Robotics and Automation Letters
سال: 2020
ISSN: 2377-3766,2377-3774
DOI: 10.1109/lra.2020.2974685